On maximum degree‐based ‐quasi‐clique problem: Complexity and exact approaches
نویسندگان
چکیده
منابع مشابه
On the Exact Maximum Complexity of Minkowski Sums of Polytopes
We present a tight bound on the exact maximum complexity of Minkowski sums of polytopes in R. In particular, we prove that the maximum number of facets of the Minkowski sum of k polytopes with m1,m2, . . . ,mk facets respectively is bounded from above by
متن کاملElectric Vehicle Scheduling and Optimal Charging Problem: Complexity, Exact and Heuristic Approaches
This paper deals with the Electric Vehicle Scheduling and Optimal Charging Problem. More precisely, given a fleet of Electric Vehicles EVs and Combustion Engine Vehicles CVs, a set of tours to be processed by vehicles and a charging infrastructure, the problem aims to optimize the assignment of vehicles to tours and minimize the charging cost of EVs, while considering several operational constr...
متن کاملthe effect of task complexity on lexical complexity and grammatical accuracy of efl learners’ argumentative writing
بر اساس فرضیه شناخت رابینسون (2001 و 2003 و 2005) و مدل ظرفیت توجه محدود اسکهان (1998)، این تحقیق تاثیر پیچیدگی تکلیف را بر پیچیدگی واژگان و صحت گرامری نوشتار مباحثه ای 60 نفر از دانشجویان زبان انگلیسی بررسی کرد. میزان پیچیدگی تکلیف از طریق فاکتورهای پراکندگی-منابع تعیین شد. همه ی شرکت کنندگان به صورت نیمه تصادفی به یکی از سه گروه: (1) گروه موضوع، (2) گروه موضوع + اندیشه و (3) گروه موضوع + اندی...
15 صفحه اولOn the complexity of the exact weighted independent set problem
Suppose we have a well-solved optimization problem, such as minimum spanning tree, maximum cut in planar graphs, minimum weight perfect matching, or maximum weight independent set in a bipartite graph. How hard is it to determine whether there exists a solution with a given weight ? Papadimitriou and Yannakakis showed in [PAPADIMITRIOU 82] that these so-called exact versions of the above optimi...
متن کاملExact Approaches for the Travelling Thief Problem
Many evolutionary and constructive heuristic approaches have been introduced in order to solve the Traveling Thief Problem (TTP). However, the accuracy of such approaches is unknown due to their inability to find global optima. In this paper, we propose three exact algorithms and a hybrid approach to the TTP. We compare these with state-of-theart approaches to gather a comprehensive overview on...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Networks
سال: 2017
ISSN: 0028-3045,1097-0037
DOI: 10.1002/net.21791